Online request server matching

Online request server matching

In this report we study a new variant of an online bipartite matching problem, which can be interpreted as a scheduling problem. Then, we have one resource, called server, which is available for one unit in every step of a discrete time model. At most one task with unit demand can occur per time step. It is called request, and speciies a set of time steps when the serving is accepted. These tim...

MyXDNS: A Request Routing DNS Server With Decoupled Server Selection

This paper presents the architecture and the preliminary evaluation of a request routing DNS server that decouples server selection from the rest of DNS functionality. Our DNS server, which we refer to as MyXDNS, exposes well-defined APIs for uploading an externally computed server selection policy and for interacting with an external network proximity service. With MyXDNS, researchers can expl...

Disk-aware Request Distribution-based Web Server Power Management

This work is concerned with reducing power consumption by cluster-based web servers. We focused on server hard disks, a major source of server power consumption. We started with the modification of Logsim, a simulator for cluster-based web servers. The new simulator, NLogsim behaves exactly like a cluster-based web server handling requests when they arrive. Based on NLogsim, we exposed the rela...

A Request Distribution Algorithm for Web Server Cluster

With the explosively increasing of web-based applications’ workloads, Web server cluster encounters challenge in response time for requests. Request distribution among servers in web server cluster is the key to address such challenge, especially under heavy workloads. In this paper, we propose a new request distribution algorithm named llac (least load active cache) for load balancing switch i...

The Trickle-Down Effect: Web Caching and Server Request Distribution